A hybrid algorithm optimization approach for machine loading problem in flexible manufacturing system

نویسندگان

  • ANN Murthy JSS Academy of Technical Education, Bangalore, 560 060, India
  • K Chandrashekara Sri Jayachamarajendra College of Engineering, Mysore, 570 006, India
  • Vijay M Kumar Department of Mechanical Engineering, JSS Academy of Technical Education, Bangalore, 560 060, India
چکیده مقاله:

The production planning problem of flexible manufacturing system (FMS) concerns with decisions that have to be made before an FMS begins to produce parts according to a given production plan during an upcoming planning horizon. The main aspect of production planning deals with machine loading problem in which selection of a subset of jobs to be manufactured and assignment of their operations to the relevant machines are made. Such problems are not only combinatorial optimization problems, but also happen to be non-deterministic polynomial-time-hard, making it difficult to obtain satisfactory solutions using traditional optimization techniques. In this paper, an attempt has been made to address the machine loading problem with objectives of minimization of system unbalance and maximization of throughput simultaneously while satisfying the system constraints related to available machining time and tool slot designing and using a meta-hybrid heuristic technique based on genetic algorithm and particle swarm optimization. The results reported in this paper demonstrate the model efficiency and examine the performance of the system with respect to measures such as throughput and system utilization.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Machine Loading in Flexible Manufacturing System: A Swarm Optimization Approach

Loading is one of the vital issues in flexible manufacturing system (FMS) production planning which deals with assignment of the necessary operations and tools among various machines in an optimal manner. Such a problem is combinatorial in nature and found to be NP-complete. In this paper, an attempt has been made to address such problems using mutation in particle swarm optimization (PSO) to a...

متن کامل

A HYBRID GENETIC ALGORITHM FOR A BI-OBJECTIVE SCHEDULING PROBLEM IN A FLEXIBLE MANUFACTURING CELL

 This paper considers a bi-objective scheduling problem in a flexible manufacturing cell (FMC) which minimizes the maximum completion time (i.e., makespan) and maximum tardiness simultaneously. A new mathematical model is considered to reflect all aspect of the manufacturing cell. This type of scheduling problem is known to be NP-hard. To cope with the complexity of such a hard problem, a genet...

متن کامل

Solving machine-loading problem of a flexible manufacturing system with constraint-based genetic algorithm

Machine-loading problem of a flexible manufacturing system is known for its complexity. This problem encompasses various types of flexibility aspects pertaining to part selection and operation assignments along with constraints ranging from simple algebraic to potentially very complex conditional constraints. From the literature, it has been seen that simple genetic-algorithm-based heuristics f...

متن کامل

A hybrid genetic algorithm for a loading problem in flexible manufacturing systems

One of the operating decisions involved in the scheduling of flexible manufacturing systems (FMS) is that of loading the FMS. Given a pool of jobs, which can be processed on alternate machines and alternate tools, the scheduler has to decide on the allocation of tools and machines to the different jobs. Various versions of this problem have appeared in the literature. We consider the version wh...

متن کامل

Machine Reliability in a Dynamic Cellular Manufacturing System: A Comprehensive Approach to a Cell Layout Problem

The fundamental function of a cellular manufacturing system (CMS) is based on definition and recognition of a type of similarity among parts that should be produced in a planning period. Cell formation (CF) and cell layout design are two important steps in implementation of the CMS. This paper represents a new nonlinear mathematical programming model for dynamic cell formation that employs the ...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


عنوان ژورنال

دوره 8  شماره 1

صفحات  -

تاریخ انتشار 2012-01-01

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023